skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Tkocz, T."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, High Dimensional Probability Proceedings, Vol. 9)
    Accepted Manuscript Full Text Available
  2. ; (, Israel journal of mathematics)
    Accepted Manuscript Full Text Available
  3. ; ; (, Analysis PDE)
    Accepted Manuscript Full Text Available
  4. ; ; (, Discrete analysis)
    null (Ed.)
    Full Text Available 
  5. ; (, The electronic journal of combinatorics)
    We establish sharp threshold for the connectivity of certain random graphs whose (dependent) edges are determined by uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show existence of a unique giant component for such random graphs. 
    more » « less
    Accepted Manuscript Full Text Available
  6. ; ; (, SIAM journal on discrete mathematics)
    We consider arbitrary graphs $$G$$ with $$n$$ vertices and minimum degree at least $$\delta n$$ where $$\delta>0$$ is constant.\\ (a) If the conductance of $$G$$ is sufficiently large then we obtain an asymptotic expression for the cover time $$C_G$$ of $$G$$ as the solution to an explicit transcendental equation.\\ (b) If the conductance is not large enough to apply (a), but the mixing time of a random walk on $$G$$ is of a lesser magnitude than the cover time, then we can obtain an asymptotic deterministic estimate via a decomposition into a bounded number of dense subgraphs with high conductance. \\ (c) If $$G$$ fits neither (a) nor (b) then we give a deterministic asymptotic (2+o(1))-approximation of $$C_G$$. 
    more » « less
    Accepted Manuscript Full Text Available